On a sequence of almost deterministic pairwise independent random variables
نویسندگان
چکیده
منابع مشابه
Pairwise Independent Random Variables
In this lecture we discuss how to derandomize algorithms. We will see a brute force algorithm (enumeration) for derandomization. We will also see that some random algorithms do not need true randomness. Specifically, we will see an example where only pairwise random bits are needed. Next, we will see how we can generate pairwise random values and how this conservation on the amount of randomnes...
متن کاملA Simple Construction of Almost k-wise Independent Random Variables
We present a simple construction of a small probability space on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is O(log log n + k + log ~), where e is the statistical difference between of the distribution induced on any k bit locations and the uniform distribution. This is asymptotically comparable to the construction recentl...
متن کاملAlmost sure convergence of weighted sums of independent random variables
Let (Ω,F ,P) be a probability space, and let {Xn} be a sequence of integrable centered i.i.d. random variables. In this paper we consider what conditions should be imposed on a complex sequence {bn} with |bn| → ∞, in order to obtain a.s. convergence of P n Xn bn , whenever X1 is in a certain class of integrability. In particular, our condition allows us to generalize the rate obtained by Marcin...
متن کاملSimple Constructions of Almost k-Wise Independent Random Variables
We present three alternative simple constructions of small proba. bility spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is (2 +o(l»(loglog n + log k + log ~), where f is the statistical difference between the distribution induced on any k bit locations and the uni form distribution. This is asymptotically comparable...
متن کاملOBDDs and (Almost) $k$-wise Independent Random Variables
OBDD-based graph algorithms deal with the characteristic function of the edge set E of a graph G = (V,E) which is represented by an OBDD and solve optimization problems by mainly using functional operations. We present an OBDD-based algorithm which uses randomization for the first time. In particular, we give a maximal matching algorithm with O(log |V |) functional operations in expectation. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1971
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1971-0279857-5